Exactness of Conventional and Supersymmetric JWKB Formulae and Global Symmetries of Stokes Graphs
نویسندگان
چکیده
It has been shown that the cases of the JWKB formulae in 1–dim QM quantizing the energy levels exactly are results of essentially one global symmetry of both potentials and their corresponding Stokes graphs. Namely, this is the invariance of the latter on translations in the complex plain of the space variable i.e. the potentials and the Stokes graphs have to be periodic. A proliferation of turning points in the basic period strips (parallelograms) is another limitation for the exactness of the JWKB formulae. A systematic analyses of a single-well class of potentials satisfying suitable conditions has been performed. Only ten potentials (with one or two real parameters) quantized exactly by the JWKB formulae have been found all of them coinciding (or being equivalent to) with the well-known ones found previously. It was shown also that the exactness of the supersymmetric JWKB formulae is a consequence of the corresponding exactness of the conventional ones and vice versa. Because of the latter two exactly JWKB quantized potentials have been additionally established. These results show that the exact SUSY JWKB formulae choose the Comtet at al [7] form of them independently of whether the supersymmetry is broken or not. A close relation between the shape invariance property of potentials considered and their meromorphic structure on the x-plane is also demonstrated. PACS number(s): 03.65.-W , 03.65.Sq , 02.30.Lt , 02.30.Mv
منابع مشابه
Observations on the JWKB treatment of the quadratic barrier
Historically, the “lowest-order” JWKB “parabolic” connection formula between the left and right classically allowed regions for tunneling through a parabolic barrier involved a rather non-JWKB-like square-root √ 1 + e−2π(−E)/~ and a non-JWKB phase factor that had been extracted from the asymptotic expansion of the parabolic cylinder function. Generalization to higher order was not obvious. We s...
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملChange of Variables as Borel Resummation of Semiclassical Series
It is shown that a change of variable in 1-dim Schrödinger equation applied to the Borel summable fundamental solutions [8, 9] is equivalent to Borel resummation of the fundamental solutions multiplied by suitably chosen h̄-dependent constant. This explains why change of variable can improve JWKB formulae [11]. It is shown also that a change of variable alone cannot provide us with the exact JWK...
متن کاملExact recovery with symmetries for the Doubly-Stochastic relaxation
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex optimization problem over the set of doubly stochastic matrices. Recent analysis has shown that for almost all pairs of isomorphic and asymmetric graphs, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998